Select Sets : Rank and File

نویسندگان

  • Abba M. Krieger
  • Moshe Pollak
چکیده

In many situations, the decision maker observes items in sequence and needs to determine whether or not to retain a particular item immediately after it is observed. Any decision rule creates a set of items that are selected. We consider situations where the available information is the rank of a present observation relative to its predecessors. Certain “natural” selection rules are investigated. Theoretical results are presented pertaining to the evolution of the number of items selected, measures of their quality and the time it would take to amass a group of a given size.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategic Evaluation of Sustainable Projects based on Hybrid Group Decision Analysis with Incomplete Information

– Sustainable evaluation of construction projects in strategy-focused condition is the main issue for municipalities to appropriately improve public sector services. In this respect, the group decision-making methods could help experts to select suitable sustainable projects and to schedule them regarding their ranking results. Therefore, the objective of this study is to present a hybrid group...

متن کامل

Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences

Rank & select data structures are one of the fundamental building blocks for many modern succinct data structures. With the continued growth of massive-scale information services, the space efficiency of succinct data structures is becoming increasingly attractive in practice. In this paper, we re-examine the design of rank & select data structures from the bottom up, applying an architectural ...

متن کامل

A Two-stage active learning method for learning to rank

Learning to rank (L2R) algorithms use a labeled training set to generate a ranking model that can later be used to rank new query results. These training sets are costly and laborious to produce, requiring human annotators to assess the relevance or order of the documents in relation to a query. Active learning algorithms are able to reduce the labeling effort by selectively sampling an unlabel...

متن کامل

DyVSoR: dynamic malware detection based on extracting patterns from value sets of registers

To control the exponential growth of malware files, security analysts pursue dynamic approaches that automatically identify and analyze malicious software samples. Obfuscation and polymorphism employed by malwares make it difficult for signature-based systems to detect sophisticated malware files. The dynamic analysis or run-time behavior provides a better technique to identify the threat. In t...

متن کامل

Rapid and accurate taxonomic classification of insect (class Insecta) cytochrome c oxidase subunit 1 (COI) DNA barcode sequences using a naïve Bayesian classifier

Supplementary Methods 1 2 Customizing the training sets 3 The format for the training files are described in the original RDP classifier 4 version 2.5 sample data folder that comes with the distribution available from 5 http://sourceforge.net/projects/rdp-classifier/ (Wang et al. 2007). For each of our training 6 sets, the two files we used to train the classifier are provided so that they can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007